Preservation of completeness by some continuous maps
نویسندگان
چکیده
منابع مشابه
On Some Special Classes of Continuous Maps
We present a survey on recent study of special continuous maps, like biquotient, triquotient, proper, perfect, open and étale maps and a selection of open problems in this area. 1. Special morphisms of Top Triquotient maps were introduced by E. Michael in [24] as those continuous maps f : X → Y for which there exists a map ( ) : OX → OY such that, for every U, V in the lattice OX of open subset...
متن کاملFibring: Completeness Preservation
A completeness theorem is established for logics with congruence endowed with general semantics (in the style of general frames). As a corollary, completeness is shown to be preserved by fibring logics with congruence provided that congruence is retained in the resulting logic. The class of logics with equivalence is shown to be closed under fibring and to be included in the class of logics wit...
متن کاملRotation Sets for Some Non–continuous Maps of Degree One
Iteration of liftings of non necessarily continuous maps of the circle into itself are considered as discrete dynamical systems of dimension one. The rotation set has proven to be a powerful tool to study the set of possible periods and the behaviour of orbits for continuous and old heavy maps. An extension of the class of maps for which the rotation set maintains this power is given.
متن کاملFibring Modal First-Order Logics: Completeness Preservation
Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of such logics, using a variation of the Henkin method that takes advantage of the presence of equality and inequality in the logic. As a corollary, completeness is shown to be preserved when fibring logics in that class...
متن کاملStrong Preservation as Completeness in Abstract Interpretation
Many algorithms have been proposed to minimally refine abstract transition systems in order to get strong preservation relatively to a given temporal specification language. These algorithms compute a state equivalence, namely they work on abstractions which are parti-transition systems in order to get strong preservation relatively to a given temporal specification language. These algorithms c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2010
ISSN: 0166-8641
DOI: 10.1016/j.topol.2010.04.004